Packing Resizable Items with Application to Video Delivery over Wireless Networks∗ Sivan Albagli-Kim† Leah Epstein‡

Source URL: www.cs.technion.ac.il

• NP-complete problems
• Operations research
• Combinatorial optimization
• Bin packing problem
• Knapsack problem
• Packing problem
• Algorithm
• Theoretical computer science
• Computational complexity theory
• Mathematics

References for the Colloquium Talk “OPTIMAL PACKINGS: PROBLEMS FOR THE AGES” presented by Salvatore Torquato, Princeton University at the Aspen Center for Physics, June 29, 2006 Abstract

Source URL: cherrypit.princeton.edu

• Abstract algebra
• Sphere packing
• Packing problem
• Random close pack
• Leech lattice
• Kepler conjecture
• Crystal
• Discrete geometry
• Mathematics
• Geometry

PDF Document

Source URL: www.mansci.ovgu.de

• Operations research
• Combinatorial optimization
• Packaging
• Discrete geometry
• NP-complete problems
• Knapsack problem
• Bin packing problem
• Packing problem
• Cutting stock problem
• Theoretical computer science
• Computational complexity theory
• Mathematics

Maejo Int. J. Sci. Technol. 2015, 9(01), Maejo International Journal of Science and Technology ISSNAvailable online at www.mijst.mju.ac.th

Source URL: www.mijst.mju.ac.th

• Containers
• Operations research
• Shipping containers
• NP-complete problems
• Discrete geometry
• Packing problem
• Containerization
• Knapsack problem
• Wooden box
• Theoretical computer science
• Computational complexity theory
• Mathematics

Approximation Algorithms Recap Advanced Algorithms – COMS31900 A polynomial time algorithm A is an α-approximation for problem P if, it always outputs a solution s with

Source URL: www.cs.bris.ac.uk

• Complexity classes
• NP-complete problems
• Bin packing problem
• Approximation algorithms
• Discrete geometry
• Packing problem
• Polynomial-time approximation scheme
• Time complexity
• Bin
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Approximation Algorithms Recap Advanced Algorithms – COMS31900 An algorithm A is an α-approximation for problem P if,

Source URL: www.cs.bris.ac.uk

• NP-complete problems
• Operations research
• Bin packing problem
• Approximation algorithm
• Job shop scheduling
• Greedy algorithm
• Algorithm
• Theoretical computer science
• Mathematics
• Applied mathematics

Data Locality Problems and Colored Bin Packing Andy Twigg (Oxford), Eduardo Xavier (Campinas, Brazil) May 11, 2009 Andy Twigg (Oxford), Eduardo Xavier (Campinas, Brazil)

Source URL: www.cs.bris.ac.uk

• Operations research
• Job shop scheduling
• Campinas
• Approximation algorithm
• Bin
• Theoretical computer science
• Applied mathematics
• Bin packing problem

Advanced Algorithms – COMS31900Lecture 18 Approximation Algorithms (part three) (Fully) Polynomial Time Approximation Schemes

Source URL: www.cs.bris.ac.uk

• NP-complete problems
• Dynamic programming
• Subset sum problem
• Bin packing problem
• Approximation algorithm
• Complexity classes
• Combinatorial optimization
• NP
• Partition problem
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

NP-completeness recap Advanced Algorithms – COMS31900 • NP is the class of problems we can

Source URL: www.cs.bris.ac.uk